Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(g(x),y,y) |
→ g(f(x,x,y)) |
|
There is one dependency pair:
|
| 2: |
|
F(g(x),y,y) |
→ F(x,x,y) |
|
The approximated dependency graph contains one SCC:
{2}.
-
Consider the SCC {2}.
There are no usable rules.
By taking the AF π with
π(F) = 1 together with
the lexicographic path order with
empty precedence,
rule 2
is strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006